Parallelization of the Rational Arnoldi Algorithm
نویسندگان
چکیده
منابع مشابه
The parallel rational Arnoldi algorithm
Since version 2.4 of the RKToolbox, the rat krylov function can simulate the parallel construction of a rational Krylov basis. This is done by imposing various nonzero patterns in a so-called continuation matrix T . Simply speaking, the j-th column of this matrix contains the coefficients of the linear combination of j rational Krylov basis vectors which have been used to compute the next (j + ...
متن کاملPolynomial Acceleration for Restarted Arnoldi Iteration and its Parallelization
We propose an accelerating method for the restarted Arnoldi iteration to compute a number of eigenvalues of the standard eigenproblem Ax = x and discuss the dependence of the convergence rate of the accelerated iteration on the distribution of spectrum. The e ectiveness of the approach is proved by numerical results. We also propose a new parallelization technique for the nonsymmetric double sh...
متن کاملUsing the Rd Rational Arnoldi Method for Exponential Integrators
In this paper we investigate some practical aspects concerning the use of the Restricted-Denominator (RD) rational Arnoldi method for the computation of the core functions of exponential integrators for parabolic problems. We derive some useful a-posteriori bounds together with some hints for a suitable implementation inside the integrators. Numerical experiments arising from the discretization...
متن کاملParallelization of the AES Algorithm
In this paper we present the parallelization process of the AES algorithm (Rijndael) along with the description of exploited parallelization tools. The data dependences analysis of loops and appropriate loop transformations were applied in order to parallelize the sequential algorithm. The OpenMP standard was chosen for representing the parallelism of the AES algorithm. Speed-up measurements fo...
متن کاملParallelization of the PC Algorithm
This paper describes a parallel version of the PC algorithm for learning the structure of a Bayesian network from data. The PC algorithm is a constraint-based algorithm consisting of five steps where the first step is to perform a set of (conditional) independence tests while the remaining four steps relate to identifying the structure of the Bayesian network using the results of the (condition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2017
ISSN: 1064-8275,1095-7197
DOI: 10.1137/16m1079178